A Sequence of Weakly Monotonic Automata with Increasing Level
نویسندگان
چکیده
In this paper, we exhibit a sequence of strongly connected aperiodic weakly monotonic automata, whose level increases with the number of states. Mathematics Subject Classification: 20M35, 68Q45, 20M07
منابع مشابه
Subset Synchronization in Monotonic Automata
We study extremal and algorithmic questions of subset synchronization in monotonic automata. We show that several synchronization problems that are hard in general automata can be solved in polynomial time in monotonic automata, even without knowing a linear order of the states preserved by the transitions. We provide asymptotically tight lower and upper bounds on the maximum length of a shorte...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملOn the Undecidability of Universality for Timed Automata with Minimal Resources
In 1994 Alur and Dill introduced timed automata and showed that universality was undecidable there. Since then it has been shown that under certain restrictions the problem becomes decidable. But the frontier between decidability and undecidability is still vast. We aim at narrowing this gap considerably. Our main accomplishment is to prove that universality stays undecidable over weakly monoto...
متن کاملReset Sequences for Monotonic Automata
Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in faster asymptotic time than Natarajan...
متن کاملAsymptotic Behavior of Weighted Sums of Weakly Negative Dependent Random Variables
Let be a sequence of weakly negative dependent (denoted by, WND) random variables with common distribution function F and let be other sequence of positive random variables independent of and for some and for all . In this paper, we study the asymptotic behavior of the tail probabilities of the maximum, weighted sums, randomly weighted sums and randomly indexed weighted sums of heavy...
متن کامل